Approximate variational inequalities and equilibria

نویسندگان

چکیده

Abstract We study relations between the solution sets of Variational Inequalities, Minty Natural Map problems and Nash Equilibrium Problems. Moreover, motivated by inherent relevance inexactness both in modeling non-cooperative games algorithms for variational inequalities, we consider inexact versions such establish to quantify how propagates from one problem other.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding Equilibria in Large Games using Variational Inequalities

In this paper, we explore an approach to computational game theory based on variational inequalities (VIs). VIs represent a comprehensive framework that provides a way to model and analyze both cooperative and noncooperative games. Given the potentially large size of real-world games, suitable algorithms must be designed that can scale gracefully with the dimension of the problems (e.g., number...

متن کامل

Existence of Nash Equilibria via Variational Inequalities in Riemannian Manifolds

In this paper, we first prove a generalization of McClendon’s variational inequality for contractible multimaps. Next, using a new generalized variational inequality, we will prove an existence theorem of Nash equilibrium for the generalized game G = (Xi;Ti, fi)i∈I in a finite dimensional Riemannian manifold. A suitable example for Nash equilibrium is given in a geodesic convex generalized game...

متن کامل

An Iterative Algorithm for Generalized Mixed Equilibria with Variational Inequalities

In this paper, we shall introduce an iterative algorithm by multi-step implicit hybrid steepestdescent method for finding a common element of the set of solutions of a finite family of generalized mixed equilibrium problems, the set of solutions of a finite family of variational inequalities for inverse strongly monotone mappings and the set of fixed points of a countable family of nonexpansive...

متن کامل

Sequential Optimality Conditions and Variational Inequalities

In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...

متن کامل

An Approximate Bundle Method for Solving Variational Inequalities

We present an approximate algorithm for solving generalized variational inequality problem (P) by combining the bundle technique with the auxiliary problem method. For subproblems we construct a new lower approximation to the involved function φ, as in the bundle method for nonsmooth optimization, which only requires the approximate function values and approximate subgradients instead of the ex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Management Science

سال: 2023

ISSN: ['1619-6988', '1619-697X']

DOI: https://doi.org/10.1007/s10287-023-00476-w